On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Nondecreasing Functions on Closed Intervals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence and Stability of Modified Random SP-Iteration for A Generalized Asymptotically Quasi-Nonexpansive Mappings

The purpose of this paper is to study the convergence and the almost sure T-stability of the modied SP-type random iterative algorithm in a separable Banach spaces. The Bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure T-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. Our result...

متن کامل

On the Convergence Rate of the Krasnosel’skiǐ–mann Iteration

The Krasnosel’skiı̆–Mann (KM) iteration is a widely used method to solve fixed point problems. This paper investigates the convergence rate for the KM iteration. We first establish a new convergence rate for the KM iteration which improves the known big-O rate to little-o without any other restrictions. The proof relies on the connection between the KM iteration and a useful technique on the con...

متن کامل

On The Convergence Of Modified Noor Iteration For Nearly Lipschitzian Maps In Real Banach Spaces

In this paper, we obtained the convergence of modified Noor iterative scheme for nearly Lipschitzian maps in real Banach spaces. Our results contribute to the literature in this area of re- search.

متن کامل

On the Convergence of Optimistic Policy Iteration

We consider a finite-state Markov decision problem and establish the convergence of a special case of optimistic policy iteration that involves Monte Carlo estimation of Q-values, in conjunction with greedy policy selection. We provide convergence results for a number of algorithmic variations, including one that involves temporal difference learning (bootstrapping) instead of Monte Carlo estim...

متن کامل

On Pmhss Iteration Methods for Continuous Sylvester Equations

The modified Hermitian and skew-Hermitian splitting (MHSS) iteration method and preconditioned MHSS (PMHSS) iteration method were introduced respectively. In the paper, on the basis of the MHSS iteration method, we present a PMHSS iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and complex symmetric positive definite/semi-definite matrices. Under suit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 2018

ISSN: 1085-3375,1687-0409

DOI: 10.1155/2018/7345401